Extension of universal cycles for globally identifying colorings of cycles
نویسندگان
چکیده
منابع مشابه
Extension of universal cycles for globally identifying colorings of cycles
In 1998, Karpovsky, Chakrabarty and Levitin introduced identifying codes to model fault diagnosis in multiprocessor systems [1]. In these codes, each vertex is identified by the vertices belonging to the code in its neighborhood. There exists a coloring variant as follows: a globally identifying coloring of a graph is a coloring such that each vertex is identified by the colors in its neighborh...
متن کاملCohomology of Colorings of Cycles
We compute the cohomology groups of the spaces of colorings of cycles, i.e., of the prodsimplicial complexes Hom (Cm, Kn). We perform the computation first with Z2, and then with integer coefficients. The main technical tool is to use spectral sequences in conjunction with a detailed combinatorial analysis of a family of cubical complexes, which we call torus front complexes. As an application ...
متن کاملUniversal cycles for permutations
A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n + 1 distinct integers are used. This is best possible and proves a conjecture of Chung, Diaconis and Graham.
متن کاملProducts of Universal Cycles
Universal cycles are generalizations of de Bruijn cycles to combinatorial patterns other than binary strings. We show how to construct a product cycle of two universal cycles, where the window widths of the two cycles may be different. Applications to card tricks are suggested.
متن کاملAcyclic Colorings of Products of Cycles
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum number k such that G has an acyclic coloring with k colors. In this paper, acyclic colorings of products of paths and cycles are considered. We determine the acyclic chromatic numbers of three such products: grid graphs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2017.02.002